Hop-Constrained Tree-Shaped Networks
نویسندگان
چکیده
Hop constraints are used to limit the number of links between two given points in a network, this way improving the quality of service by increasing the availability and reliability of the network. They have been applied to a limited number of problems, although their application can be of the greatest importance both from the academical and practical points-of-view. In this work, we survey relevant and recent works on hop-constrained problems focusing on problems with tree
منابع مشابه
A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks
Genetic algorithms and other evolutionary algorithms have been successfully applied to solve constrained minimum spanning tree problems in a variety of communication network design problems. In this paper we enlarge the application of these types of algorithms by presenting a multi-population hybrid genetic algorithm to another communication design problem. This new problem is modeled through a...
متن کاملModeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
The Hop-Constrained Minimum Spanning Tree Problem (HMSTP) is a NP-hard problem arising in the design of centralized telecommunication networks with quality of service constraints. We show that the HMSTP is equivalent to a Steiner Tree Problem (STP) in an adequate layered graph. We prove that the directed cut formulation for the STP defined in the layered graph, dominates (in terms of the linear...
متن کاملA Multi Population Genetic Algorithm for Hop-Constrained Trees in Nonlinear Cost Flow Networks∗
Genetic algorithms and other evolutionary algorithms have been successfully applied to solve constrained minimum spanning tree problems in a variety of communication network design problems. Here we propose a multi population genetic algorithm for yet another communication design problem. The new problem is modeled through a hop-constrained minimum spanning tree also exhibiting the characterist...
متن کاملModelling the Hop Constrained Connected Facility Location Problem on Layered Graphs
Gouveia et al. [3] show how to model the Hop Constrained Minimum Spanning tree problem as Steiner tree problem on a layered graph. Following their ideas, we provide three possibilities to model the Hop Constrained (HC) Connected Facility Location problem (ConFL) as ConFL on layered graphs. We show that on all three layered graphs the respective LP relaxations of two cut based models are of the ...
متن کاملDistributed Constrained Steiner Tree Algorithm for Jointly Conserving Energy and Bounding Delay in Ad hoc Multicast Routing
The minimum-energy multicast tree problem aims to construct a multicast tree rooted at the source node and spanning all the destination nodes such that the sum of transmission power at non-leaf nodes is minimized. However, aggressive power assignment at non-leaf nodes, although conserving more energy, results in multicast trees which suffer from higher hop count and jeopardizes delay-sensitive ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014